Almost Alternating Sums

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Alternating Sums

as N → ∞ is not transparent. The random walk ∑Nn=1 wn, where the wn are independent random variables taking the values ±1 with equal probability, is known [22] to typically have absolute value around c √ N , for an appropriate constant c and large N . Knowing this, and knowing that for irrational α the sequence ⌊nα⌋ is “random-ish” modulo 2, a natural guess is that |SN (α)| is also around √ N ....

متن کامل

Schur Functions and Alternating Sums

Abstract We discuss several well known results about Schur functions that can be proved using cancellations in alternating summations; notably we shall discuss the Pieri and Murnaghan-Nakayama rules, the JacobiTrudi identity and its dual (Von Nägelsbach-Kostka) identity, their proofs using the correspondence with lattice paths of Gessel and Viennot, and finally the Littlewood-Richardson rule. O...

متن کامل

A note on alternating sums

We present some results on a certain type of alternating sums which frequently arise in connection with the average-case analysis of algorithms and data structures. Whereas the so-called Rice's method for treating such sums uses complex contour integration we perform manipulations of generating functions in order to get explicit results from which asymptotic estimates follow immediately.

متن کامل

Congruences of Alternating Multiple Harmonic Sums

By convention we set H(s;n) = 0 any n < d. We call l(s) := d and |s| := ∑d i=1 |si| its depth and weight, respectively. We point out that l(s) is sometimes called length in the literature. When every si is positive we recover the multiple harmonic sums (MHS for short) whose congruence properties are studied in [9, 10, 17, 18]. There is another “non-strict” version of the AMHS defined as follows...

متن کامل

Sums of Alternating Matrices and Invertible Matrices

A square matrix is said to be alternating-clean if it is the sum of an alternating matrix and an invertible matrix. In this paper, we determine all alternating-clean matrices over any division ring K. If K is not commutative, all matrices are alternating-clean, with the exception of the 1× 1 zero matrix. If K is commutative, all matrices are alternating-clean, with the exception of odd-size alt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Mathematical Monthly

سال: 2006

ISSN: 0002-9890

DOI: 10.2307/27642030